Elements of Mathematical Analysis in PVS

نویسنده

  • Bruno Dutertre
چکیده

This paper presents the formalization of some elements of mathematical analysis using the PVS veri cation system. Our main motivation was to extend the existing PVS libraries and provide means of modelling and reasoning about hybrid systems. The paper focuses on several important aspects of PVS including recent extensions of the type system and discusses their merits and e ectiveness. We conclude by a brief comparison with similar developments using other theorem provers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Computed Scripture: Exponentially Based Fourier Regulated Construct of Quran and its Fundamentally Important Consequences

This is a fundamental article reporting newly observed mathematical-computational manifestations in Quran. The Principle Variations (PVs) for the purpose of textual analysis will be defined and a Normal Book model based on the stochastic nature of human writing will be developed. It will be shown that chapter word frequencies in Quran fit into an exponential model, in sharp contrast to the unif...

متن کامل

Assertion-Based Analysis of Hybrid Systems with PVS

Hybrid automata are a well-established mathematical model for discrete systems acting in a continuous environment. We present assertion-based proof methods for hybrid systems for inductive assertional proofs. The model and the proof-methods are rigorously formalized within the PVS theorem-prover. We validate the applicability of the approach on a number of examples.

متن کامل

Mechanical Veriication of Timed Automata: a Case Study

This paper reports the results of a case study on the feasibility of developing and applying mechanical methods, based on the proof system PVS, to prove propositions about real-time systems speci ed in the LynchVaandrager timed automata model. In using automated provers to prove propositions about systems described by a speci c mathematical model, both the proofs and the proof process can be si...

متن کامل

A Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm

In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...

متن کامل

Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study

This paper presents an assertional-style verification of the aircraft landing protocol of NASA’s SATS (Small Aircraft Transportation System) concept [1] using the I/O automata framework and the PVS theorem prover. We reconstructed the mathematical model of the landing protocol presented in [2] as an I/O automaton. In addition, we translated the I/O automaton into a corresponding PVS specificati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996